Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
441	Introduction to Complexity Theory { Lecture Notes Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Email: [removed] July 31, 1999 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2000-12-12 06:50:00 Complexity classes Mathematical optimization Structural complexity theory NP-complete Polynomial-time reduction P versus NP problem NP P-complete Probabilistically checkable proof Theoretical computer science Computational complexity theory Applied mathematics
442	Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) Wenfei Fan Floris Geerts Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-08-01 05:50:27 Complexity classes P-complete NC Parameterized complexity P FO L Reachability Time complexity Theoretical computer science Computational complexity theory Applied mathematics
443	Algorithmica[removed]: 379–399 DOI[removed]s00453[removed]Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions Yury Lifshits · Shay Mozes · Oren Weimann · Add to Reading List Source URL: yury.name Language: English - Date: 2009-11-15 04:24:21 Markov models Error detection and correction Computational complexity theory Combinatorics on words Lempel–Ziv–Welch LZ77 and LZ78 Time complexity Viterbi algorithm Dynamic programming Theoretical computer science Mathematics Applied mathematics
444	The Complexity of Accurate Floating Point Computation or Can we Compute Eigenvalues In Polynomial Time? James Demmel Mathematics and Computer Science Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2002-08-13 17:34:17 Numerical linear algebra Matrix theory Eigenvalues and eigenvectors Matrix Pivot element Floating point Singular value decomposition Algorithm Algebra Linear algebra Mathematics
445	Homework Two, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-12 01:34:34 Integer factorization algorithms Euclidean algorithm Multiplication Computational complexity theory Algorithm Time complexity Multiplication algorithm Greatest common divisor Quadratic sieve Mathematics Computational number theory Theoretical computer science
446	Reducing Truth-telling Online Mechanisms to Online Optimization Baruch Awerbuch Yossi Azar Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:16:16 Analysis of algorithms Online algorithms Probabilistic complexity theory Randomized algorithm Competitive analysis Algorithm Time complexity Reduction Auction algorithm Theoretical computer science Computational complexity theory Applied mathematics
447	Homework Three, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-17 13:59:38 Applied mathematics Public-key cryptography Probabilistic complexity theory Electronic commerce RSA Finite fields Randomized algorithm Prime number Algorithm Cryptography Mathematics Primality tests
448	19. Once Upon a Time… See what happens when you reverse the sexes of characters in a well-known story Themes Level of complexity Age Duration Add to Reading List Source URL: www.eycb.coe.int Language: English - Date: 2009-04-16 12:07:20 Biology Sociology Social psychology Folklore Cinderella Gender role Sexism Fairy tale Stepfamily Behavior Literature Gender
449	Homework Four, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-24 12:31:00 Computer science Theoretical computer science Analysis of algorithms Binary search algorithm Algorithm Time complexity Applied mathematics Mathematics Search algorithms
450	On Soft Predicates in Subdivision Motion Planning∗ Cong Wang† † Yi-Jen Chiang† Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2013-02-25 09:13:23 Computer science Motion planning Time complexity Algorithm Applied mathematics Theoretical computer science Mathematics

UPDATE